Modeling and Predicting User Interests based on Taxonomy
نویسنده
چکیده
In the thesis, we analyze user interests based on a domain specific taxonomy. We propose modeling user interests and measuring similarity of users according to the taxonomy in the domain. Then we apply our method to recommender systems. We propose identifying topics, those that include new concepts that are likely be interesting to the user even though those concepts are not present in the user profile. We try to expand user interests significantly by letting the user browse those topics. Recommender systems are widely used by content providers to drive their commercial success. Many content providers adopt methods based on collaborative filtering (CF), which is a broad term for the process of recommending items to an active user, who receives the recommendation, based on the intuition that users who access the same items with the user tend to have similar interests with the user. Basic CF methods measure the similarity of users only from the co-rating behaviors against items, and compute recommendation for the active user by analyzing the items possessed by the most similar users with the user. As a result, they are apt to recommend the types of items that have already been accessed by the user. For example, if the user highly rates a horror movie (as an item), the typical CF methods recommend items that were made by the same director, performed by the same actors, or included in the same genre, horror. Those items are not truly novel since they are often already known to the user, or easily discovered by the user. We also apply our method to knowledge management in a system devel-
منابع مشابه
Predicting Friendship Links in Social Networks Using a Topic Modeling Approach
In the recent years, the number of social network users has increased dramatically. The resulting amount of data associated with users of social networks has created great opportunities for data mining problems. One data mining problem of interest for social networks is the friendship link prediction problem. Intuitively, a friendship link between two users can be predicted based on their commo...
متن کاملSupercharging Recommender Systems using Taxonomies for Learning User Purchase Behavior
Recommender systems based on latent factor models have been effectively used for understanding user interests and predicting future actions. Such models work by projecting the users and items into a smaller dimensional space, thereby clustering similar users and items together and subsequently compute similarity between unknown user-item pairs. When user-item interactions are sparse (sparsity p...
متن کاملA Personalized Approach for Re-ranking Search Results Using User Preferences
Web search engines provide users with a huge number of results for a submitted query. However, not all returned results are relevant to the user’s needs. Personalized search aims at solving this problem by modeling search interests of the user in a profile and exploiting it to improve the search process. One of the challenges in search personalization is how to properly model user’s search inte...
متن کاملModeling User Interests for Zero-Query Ranking
Proactive search systems like Google Now and Microsoft Cortana have gained increasing popularity with the growth of mobile Internet. Unlike traditional reactive search systems where search engines return results in response to queries issued by the users, proactive systems actively push information cards to the users on mobile devices based on the context around time, location, environment (e.g...
متن کاملCollaborative Filtering by Analyzing Dynamic User Interests Modeled by Taxonomy
Tracking user interests over time is important for making accurate recommendations. However, the widely-used time-decay-based approach worsens the sparsity problem because it deemphasizes old item transactions. We introduce two ideas to solve the sparsity problem. First, we divide the users’ transactions into epochs i.e. time periods, and identify epochs that are dominated by interests similar ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010